Symmetric embeddings of free lattices into each other

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cover–Preserving Embeddings of Bipartite Orders into Boolean Lattices

We study the question which bipartite ordered sets are order preserving embeddable into two consecutive levels of a Boolean lattice. This is related to investigations on parallel computer architectures, where bipartite networks are embedded into hypercube networks. In our main Theorem we characterize these orders by the existence of a suited edge-coloring of the covering graph. We analyze the r...

متن کامل

Embeddings into the Medvedev and Muchnik lattices of Π1 classes

Let Pw and PM be the countable distributive lattices of Muchnik and Medvedev degrees of non-empty Π1 subsets of 2 , under Muchnik and Medvedev reducibility, respectively. We show that all countable distributive lattices are lattice-embeddable below any non-zero element of Pw. We show that many countable distributive lattices are lattice-embeddable below any non-zero element of PM .

متن کامل

Embeddings of Symmetric Varieties

We generalize to the case of a symmetric variety the construction of the enveloping semigroup of a semisimple algebraic group due to E.B. Vinberg, and we establish a connection with the wonderful completion of the associated adjoint symmetric variety due to C. De Concini and C.

متن کامل

Embeddings and Other Mappings of Rooted Trees Into Complete Trees

Let Tn be the complete binary tree of height n, with root 1n as the maximum element. For T a tree, define A(n;T ) = |{S ⊆ Tn : 1n ∈ S, S ∼= T}| and C(n;T ) = |{S ⊆ Tn : S ∼= T}|. We disprove a conjecture of Kubicki, Lehel and Morayne, which claims that A(n;T1) C(n;T1) ≤ A(n;T2) C(n;T2) for any fixed n and arbitrary rooted trees T1 ⊆ T2. We show that A(n;T ) is of the form ∑l j=0 qj(n)2 jn where...

متن کامل

Understanding "Each Other"

Although natural language is ambiguous, various linguistic and extra-linguistic factors often help determine a preferred reading. In this paper , we show that model generation can be used to model this process in the case of reciprocal statements. The proposed analysis builds on insights from Dalrymple et al. 98 and is shown to provide an integrated, computational account of the interplay betwe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algebra universalis

سال: 2019

ISSN: 0002-5240,1420-8911

DOI: 10.1007/s00012-019-0583-7